Restricted Evasion Attack: Generation of Restricted-Area Adversarial Example
نویسندگان
چکیده
منابع مشابه
ASP: A Fast Adversarial Attack Example Generation Framework based on Adversarial Saliency Prediction
With the excellent accuracy and feasibility, the Neural Networks (NNs) have been widely applied into the novel intelligent applications and systems. However, with the appearance of the Adversarial Attack, the NN based system performance becomes extremely vulnerable: the image classification results can be arbitrarily misled by the adversarial examples, which are crafted images with human unperc...
متن کاملTime-Restricted Sequence Generation
The classes of sequences generated by timeand spacerestricted multiple counter machines are compared to the corresponding classes generated by similarly restricted multiple tape Turing machines. Special emphasis is placed on the class of sequences generable by machines which operate in real time. Real-time Turing machines are shown to be strictly more powerful than real-time counter machines. A...
متن کاملDrawing Graphs within Restricted Area
Abstract. We study the problem of selecting a maximum-weight subgraph of a given graph such that the subgraph can be drawn within a prescribed drawing area subject to given non-uniform vertex sizes. We develop and analyze heuristics both for the general (undirected) case and for the use case of (directed) calculation graphs which are used to analyze the typical mistakes that high school student...
متن کاملGeneralized Algorithm for Restricted Weak Composition Generation - Generation Algorithm for Second-Order Restricted Weak Compositions
This paper presents a new algorithm that arrives at a generalized solution for the generation of restricted weak compositions of n-parts. In particular, this generalized algorithm covers many commonly sought compositions such as bounded compositions, restricted compositions, weak compositions, and restricted part compositions. Introduced is an algorithm for generating generalized types of restr...
متن کاملUniform Generation of Forests of Restricted Height
Tree structures occur throughout the theory of information storage. Typically each tree node contains some data information and some pointers to other tree nodes. In most cases the number k of pointer fields is fixed and the structure is referred to as a k-way tree. More formally, a k-way tree can be defined as being either empty (having no nodes) or as consisting of a root node together with a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2915971